Approximation Algorithms for Minimum-Width Annuli and Shells

Approximation Algorithms for Minimum-Width Annuli and Shells

Computing Constrained Minimum-Width Annuli of Point Sets

Approximation Algorithms for Minimum

This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes. In particular, an O(p n)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log log n= log n) (multiplicative) ratio approximation is given ...

Approximation algorithms for digraph width parameters

Treewidth of an undirected graph measures how close the graph is to being a tree. Several problems that are NP-hard on general graphs are solvable in polynomial time on graphs with bounded treewidth. Motivated by the success of treewidth, several directed analogues of treewidth have been introduced to measure the similarity of a directed graph to a directed acyclic graph (DAG). Directed treewid...

Approximation Algorithms for Minimum Time Broadcast

This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log n/ log log n) (multiplicative) ratio approximation is given ...